A Compression & Encryption Algorithm on DNA Sequences Using Dynamic Look up Table and Modified Huffman Techniques
نویسندگان
چکیده
منابع مشابه
A DNA Sequence Compression Algorithm Based on Look-up Table and LZ77
This article introduces a new DNA sequence compression algorithm which is based on look-up table and LZ77 algorithm. Combined a look-up-table-based pre-coding routine and LZ77 compression routine,this algorithm can approach a compression ratio of 1.9bits /base and even lower.The biggest advantage of this algorithm is fast, small memory occupation and it can easily be implementated.
متن کاملText Encryption with Huffman Compression
Communication between a sender and receiver needs security. It can be done in any form, like plain text or binary data. Changing the information to some unidentifiable form, can save it from assailants. For example, plain text can be coded using schemes so that a stranger cannot apprehend it. Cryptography is a subject or field which deals with the secret transmission of messages/ data between t...
متن کاملDirect Addressing Techniques of Table Look-up
Table look-up is the most time-consuming part of many SAS programs. Base SAS offers a rich collection of built-in searching techniques. Merging, SQL joins, formats, SAS indexes all serve the purpose of locating relevant data. For custom programming, SAS offers arrays, whose direct addressability lends itself to implementing just about any searching algorithm. Array-based lookup is not a ready-t...
متن کاملLook-Up-Table based Halftoning Algorithm
Screening is a low complexity halftoning algorithm that has been widely used in many applications. However, screen design requires that the stacking property be obeyed. This constraint limits the texture quality at each gray level. We present a look-up-table based halftoning algorithm for which the stacking constraint is not necessarily satisfied; but the binary patterns for individual levels a...
متن کاملA Biological sequence Compression based on Look up Table (LUT) using Complementary Palindrome of Fixed size
Data Storage costs have an appreciable proportion of total cost in the creation and analysis of DNA sequences. In particular, the increase in the DNA sequences is highly remarkable with compare to increase in the disk storage capacity. General text compression algorithms do not utilize the specific characteristics of DNA sequences. In this paper we have proposed a compression algorithm based on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Technology and Computer Science
سال: 2013
ISSN: 2074-9007,2074-9015
DOI: 10.5815/ijitcs.2013.10.05